منابع مشابه
Derivatives of Approximate Regular Expressions
Our aim is to construct a finite automaton recognizing the set of words that are at a bounded distance from some word of a given regular language. We define new regular operators, the similarity operators, based on a generalization of the notion of distance and we introduce the family of regular expressions extended to similarity operators, that we call AREs (Approximate Regular Expressions). W...
متن کاملOn Approximate Derivatives Casper Goffman and C. J. Neugebauer
Introduction. The notion of approximate derivative was introduced by A. Den joy in 1916 [l ; see also 4], and has important applications to integration theory and to the relation between partial and total derivatives. It is natural to ask whether the main properties of derivatives are also possessed by approximate derivatives. Indeed, Khintchine [3 ] has shown that Rolle's theorem holds for app...
متن کاملThe Baire Classification of Ordinary and Approximate Partial Derivatives
Introduction. It is well known that a function which is a derivative is in the first Baire class, and it is also known that a function which is an approximate derivative is in the first Baire class. The analogous statement for partial derivatives of functions of more than one variable is of course not true. For if g is a nonmeasurable function of one variable, then the function f(x, y)=x-g(y) h...
متن کاملApproximate and L Peano derivatives of non-integral order
Let n be a nonnegative integer and let u 2 (n; n + 1]. We say that f is u times Peano bounded in the approximate ( resp. L; 1 p 1) sense at x 2 R if there are numbers ff (x)g ; j j n such that f(x+ h) P j j n f (x)h = ! is O(h) in the approximate (resp. L) sense as h ! 0. Suppose f is u times Peano bounded in either the approximate or L sense at each point of a bounded measurable set E: Then fo...
متن کاملFuzzy transforms of higher order approximate derivatives: A theorem
In many practical applications, it is useful to represent a function f(x) by its fuzzy transform, i.e., by the “average” values Fi = ∫ f(x) ·Ai(x) dx ∫ Ai(x) dx over different elements of a fuzzy partition A1(x), . . . , An(x) (for which Ai(x) ≥ 0 and n ∑ i=1 Ai(x) = 1). It is known that when we increase the number n of the partition elements Ai(x), the resulting approximation get closer and cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1960
ISSN: 0002-9939
DOI: 10.2307/2034443